Intrinsic Linking and Knotting of Graphs
نویسندگان
چکیده
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper. Four graphs are established to be minor minimal intrinsically even linked, and it is conjectured that they form a complete minor minimal set. Some characterizations are given, using the simplest of the four graphs as an integral part of the arguments, that may be useful in proving the conjecture. The second half of this paper investigates a new approach to intrinsic knotting. By adapting knot energy to graphs, it is hoped that intrinsic knotting can be detected through direct computation. However, graph energies are difficult to compute, and it is unclear whether they can be used to determine whether a graph is intrinsically knotted.
منابع مشابه
Intrinsic Linking and Knotting in Virtual Spatial Graphs
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several examples of intrinsically virtually linked and knotted graphs. As a byproduct, ...
متن کاملIntrinsic Linking and Knotting of Graphs in Arbitrary 3–manifolds
We prove that a graph is intrinsically linked in an arbitrary 3-manifold M if and only if it is intrinsically linked in S. Also, assuming the Poincaré Conjecture, a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S.
متن کاملIntrinsic Knotting and Linking of Complete Graphs
We show that for every m ∈ N , there exists an n ∈ N such that every embedding of the complete graph Kn in R contains a link of two components whose linking number is at least m . Furthermore, there exists an r ∈ N such that every embedding of Kr in R contains a knot Q with |a2(Q)| ≥ m , where a2(Q) denotes the second coefficient of the Conway polynomial of Q . AMS Classification 57M25; 05C10
متن کاملA Sufficient Condition for Intrinsic Knotting of Bipartite Graphs
We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| ≥ 4|V (G)| − 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant Cn such that a bipartite graph with exactly n ≥ 5 vertices in one part and |E(G)| ≥ 4|V (G)| + Cn is...
متن کامل